An algebraic characterization of unary two-way transducers

نویسندگان

  • Christian Choffrut
  • Bruno Guillon
چکیده

Two-way transducers are ordinary finite two-way automata that are provided with a one-way write-only tape. They perform a word to word transformation. Unlike one-way transducers, no characterization of these objects as such exists so far except for the deterministic case. We study the other particular case where the input and output alphabets are both unary but when the transducer is not necessarily deterministic. This yields a family which extends properly the rational relations in a very natural manner. We show that deterministic two-way unary transducers are no more powerful than one-way transducers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ICTCS ’ 14 Fifteenth Italian Conference on

argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making Stefano Bistarelli, Martine Ceberio, Joel A. Henderson, Francesco Santini 247 Optimal placement of storage nodes in a wireless sensor network Gianlorenzo D’Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti 259 Engineering shortest-path algorithms for dynamic networks Mattia D...

متن کامل

Algebraic Characterization of Edible Powerdomains

Powerdomains like mixes, sandwiches, snacks and scones are typically used to provide semantics of collections of descriptions of partial data. In particular, they were used to give semantics of databases with partial information. In this paper we argue that to be able to put these constructions into the context of a programming languages it is necessary to characterize them as free (ordered) al...

متن کامل

Input- or output-unary sweeping transducers are weaker than their 2-way counterparts

In a previous paper we showed that two-way (nondeterministic) transducers with unary input and output alphabets have the same recognition power as the sweeping ones. We show that this no longer holds when one of the alphabets has cardinality at least 2. Mathematics Subject Classification. 68Q70.

متن کامل

Algebraic Transformation of Unary Partial Algebras I: Double-Pushout Approach

The transformation of total graph structures has been studied from the algebraic point of view over more than two decades now, and it has motivated the development of the so-called double-pushout and single-pushout approaches to graph transformation. In this article we extend the double-pushout approach to the algebraic transformation of partial many-sorted unary algebras. Such a generalization...

متن کامل

Algebraic Transformation of Unary Partial Algebras II: Single-Pushout Approach

The single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unary algebras. The main result presented in this article is an algebraic characterization of the single-pushout transformation in the categories of all conformisms, all closed quomorphisms, and all closed-domain closed quomorphisms of unary partial algebras over a given signat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014